Branching on a Sierpinski graph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Branching on a Sierpinski graph

∧ explicitly with a number of recursive formulas concerning the probability generating functions EtY (k), k ≥ 1. A section is also devoted to the analysis of extinction probabilities for the branching process developing in this specific fractal set. © 2008 Published by Elsevier B.V.

متن کامل

Iterating the branching operation on a directed graph

The branching operation D, defined by Propp, assigns to any directed graph G another directed graph D(G) whose vertices are the oriented rooted spanning trees of the original graph G. We characterize the directed graphs G for which the sequence δ(G) = (G,D(G), D(G), . . .) converges, meaning that it is eventually constant. As a corollary of the proof we get the following conjecture of Propp: fo...

متن کامل

Asymptotically one-dimensional diffusion on the Sierpinski gasket and multi-type branching processes with varying environment

Asymptotically one-dimensional diffusions on the Sierpinski gasket constitute a one parameter family of processes with significantly different behaviour to the Brownian motion. Due to homogenization effects they behave globally like the Brownian motion, yet locally they have a preferred direction of motion. We calculate the spectral dimension for these processes and obtain short time heat kerne...

متن کامل

Analysis on the Sierpinski Carpet

The ‘analysis on fractals’ and ‘analysis on metric spaces’ communities have tended to work independently. Metric spaces such as the Sierpinski carpet fail to satisfy some of the properties which are generally assumed for metric spaces. This survey discusses analysis on the Sierpinski carpet, with particular emphasis on the properties of the heat kernel. 1. Background and history Percolation was...

متن کامل

Interacting dimers on a Sierpinski gasket

The different manners of embedding subgraphs of many disjoint edges in a parent graph arise in several different chemical and physical contexts. The problem of enumeration, or more generally of weighted summation, of such embeddings seems quite difficult to treat quantitatively, at least for general extended graphs. The special extended parent graph treated here with the inclusion of interactio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics & Probability Letters

سال: 2009

ISSN: 0167-7152

DOI: 10.1016/j.spl.2008.07.032